Factoring numbers with interfering random waves
نویسندگان
چکیده
منابع مشابه
Factoring Large Numbers with the TWIRL Device
The security of the RSA cryptosystem depends on the difficulty of factoring large integers. The best current factoring algorithm is the Number Field Sieve (NFS), and its most difficult part is the sieving step. In 1999 a large distributed computation involving hundreds of workstations working for many months managed to factor a 512-bit RSA key, but 1024-bit keys were believed to be safe for the...
متن کاملFactoring Large Numbers With a Quadratic Sieve
The quadratic sieve algorithm was used to factor a 47-digit number into primes. A comparison with Wagstaff's results using the continued fraction early abort algorithm suggests that QS should be faster than CFEA when the number being factored exceeds 60 digits (plus or minus ten or more digits, depending on details of the hardware and software).
متن کاملFactoring Large Numbers with the TWINKLE
The current record in factoring large RSA keys is the factorization of a 465 bit (140 digit) number achieved in February 1999 by running the Number Field Sieve on hundreds of workstations for several months. This paper describes a novel factoring technique which is several orders of magnitude more e cient. It is based on a very simple handheld optoelectronic device which can analyse 100,000,000...
متن کاملLaws of Large Numbers for Random Linear
The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...
متن کاملFactoring Large Numbers with a Programmable Hardware Implementation of Sieving
This paper develops and evaluates an architecture for high-speed number factoring on a configurable computing system based on field programmable gate arrays (FPGA). Currently, the primary interest in factoring large integers is to test the integrity of a number of cryptosystems, particularly the RSA public key system developed by Rivest, Shamir, and Adleman [4, 5]. The RSA algorithm can be used...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2008
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/83/34008